Finite Type Structures within Combinatory Algebras

نویسنده

  • Inge Bethke
چکیده

Inside a combinatory algebra, there are 'internal' versions of the nite type structure over !, which form models of various systems of nite type arithmetic. This paper compares internal representations of the intensional and extensional functionals. If these classes coincide, the algebra is called ft-extensional. Some criteria for ft-extensionality are given and a number of well-known ca's are shown to be ft-extensional, regardless of the particular choice of representation for !. In particular, D A , P ! , T ! , H ! and certain D 1-models all share the property of ft-extensionality. It is also shown that ft-extensionality is by no means an intrinsic property of ca's, i.e. that there exists a very concrete class of ca's-the class of reeexive coherence spaces-no member of which has this property. This leads to a comparison of ft-extensionality with the well-studied notions of extensionality and weak extensionality. Ft-extensionality turns out to be completely independent .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set - Theoretical Models of a - Calculus : Theories , Expansions , Isomorphisms *

This paper mainly deals with the models for type free h-calculus defined by Plotkin [IS], Engeler [12] and Scott [22]. (See also [9] for a similar construction.) Plotkin-Scott-Algebras (PSE-Algebras, in view of Engeler’s approach) are built up in a very natural set theoretic way and provide a generalization of early ideas in Scott [20,21]. Namely, the notion of application (interpreting formal ...

متن کامل

Partial Combinatory Algebras of Functions

We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley’s preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results i...

متن کامل

Geometry of Interaction and Linear Combinatory Algebras

We present an axiomatic framework for Girard’s Geometry of Interaction, based on the notion of linear combinatory algebra. We give a general construction on traced monoidal categories with certain additional structure, sufficient to capture the exponentials of Linear Logic, which produces such algebras (and hence also ordinary combinatory algebras). We illustrate the construction on six standar...

متن کامل

Realizability algebras III: some examples

The notion of realizability algebra, which was introduced in [17, 18], is a tool to study the proof-program correspondence and to build new models of set theory, which we call realizability models of ZF. It is a variant of the well known notion of combinatory algebra, with a new instruction cc, and a new type for the environments. The sets of forcing conditions, in common use in set theory, are...

متن کامل

Extending partial combinatory algebras

We give a negative answer to the question whether every partial combinatory algebra can be completed. The explicit counterexample will be an intricately constructed term model, the construction and the proof that it works heavily depending on syntactic techniques. In particular, it is a nice example of reasoning with elementary diagrams and descendants. We also include a domain-theoretic proof ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 55  شماره 

صفحات  -

تاریخ انتشار 1991